منابع مشابه
Minimal Words Aren’t Minimal Feet
Since McCarthy and Prince (1986), most linguists have claimed that the minimal content word of a language is equivalent to the minimal foot allowed by the language. In this paper I survey minimal word restrictions in over fifty languages to show that the minimal word syndrome is not connected to foot structure. Instead, in some cases the minimal word of a language is connected to stress propert...
متن کاملWords Guaranteeing Minimal Image
Given a positive integer n and a finite alphabet Σ, a word w over Σ is said to guarantee minimum image if, for every homomorphism φ from the free monoid Σ∗ over Σ into the monoid of all transformations of an n-element set, the range of the transformation wφ has the minimum cardinality among the ranges of all transformations of the form vφ where v runs over Σ∗ . Although the existence of words g...
متن کاملMinimal Convex Decompositions
Let P be a set of n points on the plane in general position. We say that a set Γ of convex polygons with vertices in P is a convex decomposition of P if: Union of all elements in Γ is the convex hull of P, every element in Γ is empty, and for any two different elements of Γ their interiors are disjoint. A minimal convex decomposition of P is a convex decomposition Γ′ such that for any two adjac...
متن کاملLocally Convex Words and Permutations
We introduce some new classes of words and permutations characterized by the second difference condition π(i − 1) + π(i + 1) − 2π(i) ≤ k, which we call the k-convexity condition. We demonstrate that for any sized alphabet and convexity parameter k, we may find a generating function which counts k-convex words of length n. We also determine a formula for the number of 0-convex words on any fixed...
متن کاملOn Minimal Sturmian Partial Words
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hole and matches (or is compatible with) every letter in A. The subword complexity of a partial word w, denoted by pw(n), is the number of distinct full words (those without holes) over the alphabet that are compatible with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.06.025